On the functions generated by the general purpose analog computer
نویسندگان
چکیده
منابع مشابه
On the Functions Generated by the General Purpose Analog Computer
We consider the General Purpose Analog Computer (GPAC), introduced by Claude Shannon in 1941 as a mathematical model of Differential Analysers, that is to say as a model of continuous-time analog (mechanical, and later one electronic) machines of that time. We extend the model properly to a model of computation not restricted to univariate functions (i.e. functions f : R → R) but also to the mu...
متن کاملon the teacher-generated v.s. leaner-generated noticing-the-gap activities in language classes
abstract the purpose of this study is twofold: on the one hand, it is intended to see what kind of noticing-the –gap activity (teacher generated vs. learner generated) is more efficient in teaching l2 grammar in classroom language learning. on the other hand, it is an attempt to determine which approach of the noticing-the-gap- activity is more effective in the long- term retention of grammar...
Some recent developments on Shannon's General Purpose Analog Computer
This paper revisits one of the first models of analog computation, the General Purpose Analog Computer (GPAC). In particular, we restrict our attention to the improved model presented in [11] and we show that it can be further refined. With this we prove the following: (i) the previous model can be simplified; (ii) it admits extensions having close connections with the class of smooth continuou...
متن کاملThe General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation
In this paper we revisit one of the first models of analog computation, Shannon’s General Purpose Analog Computer (GPAC). The GPAC has often been argued to be weaker than computable analysis. As main contribution, we show that if we change the notion of GPACcomputability in a natural way, we compute exactly all real computable functions (in the sense of computable analysis). Moreover, since GPA...
متن کاملTuring Machines Can Be Efficiently Simulated by the General Purpose Analog Computer
The Church-Turing thesis states that any sufficiently powerful computational model which captures the notion of algorithm is computationally equivalent to the Turing machine. This equivalence usually holds both at a computability level and at a computational complexity level modulo polynomial reductions. However, the situation is less clear in what concerns models of computation using real numb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2017
ISSN: 0890-5401
DOI: 10.1016/j.ic.2017.09.015